Sub-Super-stochastic Matrix with Applications to Bipartite Tracking Control over Signed Networks
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 22 January 2019Accepted: 05 August 2021Published online: 06 December 2021Keywordssub-stochastic matrix, super-stochastic multi-agent systems, bipartite tracking controlAMS Subject Headings93A14, 93C55, 15B51, 05C50Publication DataISSN (print): 0363-0129ISSN (online): 1095-7138Publisher: Society for Industrial and Applied MathematicsCODEN: sjcodc
منابع مشابه
Dynamics over Signed Networks
A signed network is a network with each link associated with a positive or negative sign. Models for nodes interacting over such signed networks, where two types of interactions are defined along the positive and negative links, respectively, arise from various biological, social, political, and economical systems. As modifications to the conventional DeGroot dynamics for positive links, two ba...
متن کاملModule identification in bipartite networks with applications to directed networks
Modularity is one of the most prominent properties of real-world complex networks. Here, we address the issue of module identification in an important class of networks known as bipartite networks. Nodes in bipartite networks are divided into two non-overlapping sets, and the links must have one end node from each set. We suggest a novel approach especially suited for module detection in bipart...
متن کاملSigned Degree Sequences in Signed Bipartite Graphs
A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V ) be a signed bipartite graph with U = {u1, u2, · · · , up} and V = {v1, v2, · · · , vq} . Then signed degree of ui is sdeg(ui) = di = d + i − d − i , where 1 ≤ i ≤ p and d+i ( d − i ) is the number of positive(negative) edges incident with ui , and signed degree of vj is sdeg(...
متن کاملSigned degree sets in signed bipartite graphs
A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...
متن کاملBipartite consensus of multi-agent systems over signed graphs: State feedback and output feedback control approaches
This paper studies bipartite consensus problems for continuous-time multi-agent system over signed directed graphs. We consider general linear agents and design both state feedback and dynamic output feedback control laws for the agents to achieve bipartite consensus. Via establishing an equivalence between bipartite consensus problems and the conventional consensus problems under both state fe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Control and Optimization
سال: 2021
ISSN: ['0363-0129', '1095-7138']
DOI: https://doi.org/10.1137/19m1239982